Distance-based topological indices of tensor product of graphs

Authors

Abstract:

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investigated, when H is a strongly triangular graph. As a special case most of results given by Hoji, Luob and Vumara in [Wiener and vertex PI indices of Kronecker products of graphs, Discrete Appl. Math., 158 (2010), 1848-1855] will be deduced.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Distance-Based Topological Indices of Tensor Product of Graphs

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G)  V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

full text

computing some topological indices of tensor product of graphs

a topological index of a molecular graph g is a numeric quantity related to g which isinvariant under symmetry properties of g. in this paper we obtain the randić, geometricarithmetic,first and second zagreb indices , first and second zagreb coindices of tensorproduct of two graphs and then the harary, schultz and modified schultz indices of tensorproduct of a graph g with complete graph of ord...

full text

A Note on Tensor Product of Graphs

Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.

full text

Distance-Based Topological Indices and Double graph

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

full text

Distance-based topological polynomials and indices of friendship graphs

Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical properties of the compounds. In this article, by...

full text

Wiener Polarity Index of Tensor Product of Graphs

Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 3  issue 1

pages  45- 53

publication date 2012-02-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023